An Efficient Decision Procedure for UTVPI Constraints
نویسندگان
چکیده
A unit two variable per inequality (UTVPI) constraint is of the form a.x+b.y ≤ d where x and y are integer variables, the coefficients a, b ∈ {−1, 0, 1} and the bound d is an integer constant. This paper presents an efficient decision procedure for UTVPI constraints. Given m such constraints over n variables, the procedure checks the satisfiability of the constraints in O(n.m) time and O(n+m) space. This improves upon the previously known O(n.m) time and O(n) space algorithm based on transitive closure. Our decision procedure is also equality generating, proof generating, and model generating.
منابع مشابه
A SAT-Based Decision Procedure for Mixed Logical/Integer Linear Problems
In this paper, we present a method for solving Mixed Logical/Integer Linear Programming (MLILP) problems that integrates a polynomial-time ILP solver for the special class of Unit-Two-VariablePer-Inequality (unit TVPI or UTVPI) constraints of the form , where , into generic Boolean SAT solvers. In our approach the linear constraints are viewed as special literals and replaced by binary “indicat...
متن کاملIncremental Satisfiability and Implication for UTVPI Constraints
Unit two-variable-per-inequality (UTVPI) constraints form one of the largest class of integer constraints which are polynomial time solvable (unless P=NP). There is considerable interest in their use for constraint solving, abstract interpretation, spatial databases, and theorem proving. In this paper we develop new incremental algorithms for UTVPI constraint satisfaction and implication checki...
متن کاملA Scalable Method for Solving Satisfiability of Integer Linear Arithmetic Logic
In this paper, we present a hybrid method for deciding problems involving integer and Boolean variables which is based on generic SAT solving techniques augmented with a) a polynomial-time ILP solver for the special class of Unit-Two-Variable-Per-Inequality (unit TVPI or UTVPI) constraints and b) an independent solver for general integer linear constraints. In our approach, we present a novel m...
متن کاملOn Solving Boolean Combinations of UTVPI Constraints
We consider the satisfiability problem for Boolean combinations of unit two variable per inequality (UTVPI) constraints. A UTVPI constraint is linear constraint containing at most two variables with non-zero coefficients, where furthermore those coefficients must be either −1 or 1. We prove that if a satisfying solution exists, then there is a solution with each variable taking values in [−n · ...
متن کاملAN EFFICIENT OPTIMIZATION PROCEDURE BASED ON CUCKOO SEARCH ALGORITHM FOR PRACTICAL DESIGN OF STEEL STRUCTURES
Different kinds of meta-heuristic algorithms have been recently utilized to overcome the complex nature of optimum design of structures. In this paper, an integrated optimization procedure with the objective of minimizing the self-weight of real size structures is simply performed interfacing SAP2000 and MATLAB® softwares in the form of parallel computing. The meta-heuristic algorithm chosen he...
متن کامل